Margarita Korovina

نویسنده

  • Margarita Korovina
چکیده

Pfaffian Hybrid Systems. Pfaffian hybrid systems, which we recently introduced in [18], are a sub-class of o-minimal hybrid systems which capture rich continuous dynamics and yet can be studied using finite bisimulations. In particular Pfaffian hybrid systems include hybrid systems with continuous dynamics definable by functions such as exp, sin, cos, and other trigonometric functions in appropriate domains. The existence of finite bisimulations is crucial for most decidability results for hybrid systems. We have investigated complexity of algorithms for finite bisimulations of Pfaffian hybrid systems [18, 10]. Based on these results we studied satisfiability of viability constraints and invariants [16, 8]. As part of CICADA project we develop tools for reachability analysis for Pfaffian hybrid systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Preface to the special issue: Continuity, computability, constructivity: from logic to algorithms 2013

HAJIME ISHIHARA†, MARGARITA KOROVINA‡, ARNO PAULY§, MONIKA SEISENBERGER¶ and DIETER SPREEN‖ †School of Information Science, Japan Advanced Institute of Science and Technology, 1-1 Asahidai, Nomi, Ishikawa 923-1292, Japan Email: [email protected] ‡A.P. Ershov Institute of Informatics Systems, Russian Academy of Science, Siberian Branch, Prospekt Lavrentev 6, Novosibirsk, 630090, Russia Email:...

متن کامل

Computing combinatorial types of trajectories in Pfaffian Dynamics

Available online 10 February 2009 Dedicated to Dieter Spreen on the occasion of his 60th birthday

متن کامل

Fixed points on abstract structures without the equality test

In this paper we present a study of definability properties of fixed points of effective operators on abstract structures without the equality test. In particular we prove that Gandy theorem holds for the reals without the equality test. This provides a useful tool for dealing with recursive definitions using Σ-formulas.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008